A QUEUEING MODEL FOR A TECHNICAL CONTROL FACILITYFISCHER MJ.1978; A.I.I.E. TRANS.; USA; DA. 1978; VOL. 10; NO 1; PP. 76-80; BIBL. 8 REF.Article

THE WAITING TIME IN THE E_K/M/1 QUEUING SYSTEM.FISCHER MJ.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 4; PP. 898-902; BIBL. 3 REF.Article

AN APPROXIMATION TO QUEUEING SYSTEMS WITH INTERRUPTIONSFISCHER MJ.1977; MANAG. SCI.; USA; DA. 1977; VOL. 24; NO 3; PP. 338-344; BIBL. 10 REF.Article

TWO QUEUEING SYSTEMS SHARING THE SAME FINITE WAITING ROOMFISCHER MJ.1978; NAV. RES. LOGIST. QUART.; USA; DA. 1978; VOL. 25; NO 4; PP. 667-679; BIBL. 10 REF.Article

ON DESCRIBING THE BEHAVIOR AND IMPLEMENTATION OF DISTRIBUTED SYSTEMSLYNCH NA; FISCHER MJ.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 1; PP. 17-43; BIBL. 15 REF.Article

A MODEL FOR EVALUATING THE PERFORMANCE OF AN INTEGRATED CIRCUIT- AND PACKET-SWITCHED MULTIPLEX STRUCTURE.FISCHER MJ; HARRIS TC.1976; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1976; VOL. 24; NO 2; PP. 195-202; BIBL. 8 REF.Article

RELATIONS AMONG COMPLEXITY MEASURESPIPPENGER N; FISCHER MJ.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 2; PP. 361-381; BIBL. 11 REF.Article

A LOWER BOUND FOR THE TIME TO ASSURE INTERACTIVE CONSISTENCYFISCHER MJ; LYNCH NA.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 4; PP. 183-186; BIBL. 7 REF.Article

ON THE COMPLEXITY OF 2-OUTPUT BOOLEAN NETWORKSGALBIATI G; FISCHER MJ.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 177-185; BIBL. 14 REF.Article

SACRIFICING SERIALIZABILITY TO ATTAIN HIGH AVAILABILITY OF DATA IN AN UNRELIABLE NETWORKFISCHER MJ; MICHAEL A.1982; SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS/1982-03-29/LOS ANGELES CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1982; PP. 70-75; BIBL. 21 REF.Conference Paper

PARALLEL PREFIX COMPUTATIONLADNER RE; FISCHER MJ.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 831-838; BIBL. 10 REF.Article

PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMSFISCHER MJ; LADNER RE.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 2; PP. 194-211; BIBL. 22 REF.Article

SELECTED VOCAL CUES AND COUNSELORS' PERCEPTIONS OF GENUINENESS, SELF-DISCLOSURE, AND ANXIETY = INDICES VOCAUX SELECTIONNES ET PERCEPTIONS DE LA SINCERITE, DE LA REVELATION DE SOI ET DE L'ANXIETE PAR LES CONSEILLERSFISCHER MJ; APOSTAL RA.1975; J. COUNSELG PSYCHOL.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 92-96; BIBL. 21REFArticle

GLOBAL STATES OF A DISTRIBUTED SYSTEMFISCHER MJ; GRIFFETH ND; LYNCH NA et al.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 3; PP. 198-202; BIBL. 4 REF.Article

MULTICHANNEL QUEUEING SYSTEMS WITH HETEROGENEOUS CLASSES OF ARRIVALS.NARAYAN BHAT U; FISCHER MJ.1976; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1976; VOL. 23; NO 2; PP. 271-282; BIBL. 8 REF.Article

A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINESBORODIN A; FISCHER MJ; KIRKPATRICK DG et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 351-364; BIBL. 18 REF.Article

MODELING A VOICE NETWORK WITH PREEMPTIONCALABRESE DA; FISCHER MJ; HOIEM BE et al.1979; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1979; VOL. 28; NO 1; PP. 22-27; BIBL. 7 REF.Article

OMEGA (N LOG N) LOWER BOUNDS ON LENGTH OF BOOLEAN FORMULASFISCHER MJ; MEYER AR; PATERSON MS et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 416-427; BIBL. 23 REF.Article

RESOURCE ALLOCATION WITH IMMUNITY TO LIMITED PROCESS FAILURE.FISCHER MJ; LUNCH NA; BURNS JE et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 234-254; BIBL. 14 REF.Conference Paper

LARGE SCALE COMMUNICATION NETWORKS, DESIGN AND ANALYSISFISCHER MJ; GARBIN DA; HARRIS TC et al.1978; OMEGA; GBR; DA. 1978; VOL. 6; NO 4; PP. 331-340; BIBL. 17 REF.Article

REFINEMENTS OF THE NONDETERMINISTIC TIME AND SPACE HIERARCHIES.SEIFERAS JI; FISCHER MJ; MEYER AR et al.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 130-137; BIBL. 12 REF.Conference Paper

DATA REQUIREMENTS FOR IMPLEMENTATION OF N-PROCESS MUTUAL EXCLUSION USING A SINGLE SHARED VARIABLEBURNS JE; JACKSON P; LYNCH NA et al.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 1; PP. 183-205; BIBL. 19 REF.Article